;;problem 3 largest prime of 317584931803
(print 
 (do ((div 2 (+ div 1))
      (n 317584931803 
	 (if (zerop (mod n div))
	     (/ n div)
	     n)))
     ((< (/ n 2) div) n)))

(print
 (do ((nums 0)
      (i 999 (1- i)))
     ((< i 1) nums) 
   (do ((j 999 (1- j)))
       ((< j 1) )
     (if (palindrom (* i j))
	 (setq nums (max (* i j) nums))))))